Unifying Refinement and Hoare-Style Reasoning in a Logic for Higher-Order Concurrency (Technical Appendix)
نویسندگان
چکیده
ing stacks to bags We want to show Bag(stacks ). Λ. Prop context: Variables: p, q ∀x. TokPure(p(x)) ∧ (p(x)⇒ q(x)) {True} let hds = new (none) {s ↪→i none} {Repp(hds)} let sync = mkSync() {sync ∈ Syncer(Repp(hds))}
منابع مشابه
Isabelle/Circus
The Circus specification language combines elements for complex data and behavior specifications, using an integration of Z and CSP with a refinement calculus. Its semantics is based on Hoare and He’s unifying theories of programming (UTP). Isabelle/Circus is a formalization of the UTP and the Circus language in Isabelle/HOL. It contains proof rules and tactic support that allows for proofs of ...
متن کاملOperational Semantics for Model Checking Circus
Circus is a combination of Z, CSP, and the refinement calculus, and is based on Hoare & He’s Unifying Theories of Programming. A model checker is being constructed for the language to conduct refinement checking in the style of FDR, but supported by theorem proving for reasoning about the complex states and data types that arise from the use of Z. FDR deals with bounded labelled transition syst...
متن کاملThe Logic of U·(tp )
U·(TP) is a theorem prover developed to support the Unifying Theories of Programming (UTP) framework. Its primary design goal was to support the higher-order logic, alphabets, equational reasoning and “programs as predicates” style that is prevalent in much of the UTP literature, from the seminal work by Hoare & He onwards. In this paper we focus on the underlying logic of the prover, emphasisi...
متن کاملType-theoretic semantics for transactional concurrency
We propose a dependent type theory that combines programming, specifications and reasoning about higher-order concurrent programs with shared higher-order transactional memory. We build on our previous work on Hoare Type Theory (HTT), which is extended here with types that correspond to Hoare-style specifications for transactions. The new types have the form CMD {I}{P} x:A{Q}, and classify conc...
متن کاملSpecifying and Verifying Concurrent Algorithms with Histories and Subjectivity
We present a lightweight approach to Hoare-style specifications for fine-grained concurrency, based on a notion of time-stamped histories that abstractly capture atomic changes in the program state. Our key observation is that histories form a partial commutative monoid, a structure fundamental for representation of concurrent resources. This insight provides us with a unifying mechanism that a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013